The Concept of Deadlock and Livelock in Hybrid Control Systems

نویسندگان

  • Alessandro Abate
  • Alessandro D'Innocenzo
  • Giordano Pola
  • Maria Domenica Di Benedetto
  • S. Shankar Sastry
چکیده

This short paper qualitatively introduces the definition of the concepts of Deadlock and Livelock for a general class of Hybrid Control Systems (HCS). Such a characterization hinges on three important aspects: firstly, the concept of composition of HCS; secondly, the general concept of specifications and their composition for HCS; finally, the dynamical structure and behaviors of HCS. The first aspect is introduced in a novel manner, including ideas from the literature of discrete transition systems, and accounting for concepts such as feedback interconnections of dynamical systems. The second point accounts for general properties that are of interest from a systems and control theory perspective. The third part categorizes between the diverse and possibly pathological behaviors that are characteristic to HCS. A first look at the problems of Deadlock and Livelock Verification concludes the manuscript. Introduction. The concept of deadlock and its close relative, that of livelock, have been widely investigated in the literature of various branches of computer science. Deadlock, in particular, has often been regarded as a pathology and associated with the deficiency of a liveness specification, that of forward progress [6]. Much interesting work has been focused on verifying the presence of deadlock situations in algorithms or programs, or ensuring its absence upon their composition [3][4]. Hybrid Systems are rather general mathematical models that connect between discrete, logical, synchronous systems and continuous, real-time, asynchronous ones [2]. It has often been observed that they present behaviors or are endowed with properties that are “at the limit” between classical transition systems and dynamical models [2]. Motivated by a number of case studies, this work aims at “exporting” the notions of deadlock and livelock to the Hybrid Control Systems (HCS) case. More precisely, the objective has been that of first introducing a mathematically rigorous definition of the phenomena and providing a clear characterization of them. We stress that the introduced concepts nicely taylor back to similar ones in the literature of, respectively, discrete and continuous systems. Deterministic Hybrid Control Systems. The model for HCS is a melange between the classic hybrid automaton [2] and the HIOA [4]. In particular, it adheres to a denotational definition at the internal, state-space level, while it is inspired by an operational characterization at the external, input/output level. More precisely, an HCS is characterized by a finite collection of modes, each of which is associated with a domain and a control-dependent vector field. The set of transition relations is composed of a collection of edges (ordered pairs of modes), guards (subsets of the domains and possibly control-dependent), and deterministic reset functions. The control space, to which time-dependent control functions belong, is assumed to be bounded. Finally, the HCS is endowed with an observation space: the output functions will be obtained from the hybrid trajectories via a static output map. The set of initial conditions is a subset of the hybrid state space. It is possible to raise some rather general assumptions to enforce the determinism of the model. To introduce the concept of executions of the HCS, it is first necessary to define the hybrid time set, a rather classical notion in the literature, as an ordered sequence of time intervals that represent the “dwelling times” of the continuous evolution within a mode. The hybrid trajectory, or hybrid flow, is then introduced as the pair of discrete and continuous evolutions of the flow. Finally, the hybrid execution is a hybrid trajectory which abides by the flowing and switching within a particular HCS and is thus characteristic of its internal structure. The output of the hybrid system is, for each execution, a function from the hybrid time set to the output space. Since our purpose is to set up a notion of input-output interconnection, in the spirit of [4], we suppose that the interconnectable output of hybrid systems considered is instead a physical signal expressed by means of a function of the real time, obtained by a simple operation on the output of the HCS. This assumption is motivated by the aim of giving a notion of interconnection that is asynchronous. Hybrid Systems Composition. Abstractly, the concept of systems composition may be introduced in many ways, depending on the characteristics and properties of the systems that are considered, the structure of the operation , and the particular properties that we may want to check for. In this work we consider an operation that may be interpreted as a form of parallel composition. Unlike previous work though, which simply performed parallel compositions as crude variables “sharing”, inspired here by a more control theoretical perspective we allow the connections between inputs and outputs of the systems to depend on general functions endowed with some properties. Doing so, we naturally introduce an output feedback framework. Notice that the introduction of a model structure with internal and external components, similar to that in [4], allows to conceive the system at the level of its hidden/internal variables (the hybrid state space with its vector fields and transition relations) as a black box and only focus on the external components when performing the interconnection. Proper “compatibility” conditions on two general HCS need to be raised before composing them. The actual HCS, result of the composition, is defined as follows: the “internal” structure of the composed system is basically the cartesian product of the two hybrid automata. Two interconnecting static maps turn a transformation of the original output space of one of the two systems into part of the original input space of the other system, and vice versa. The new output space is simply the cartesian product of the original two, while the input space of the composition is, intuitively, the set of “unused inputs” of the composition. In the extreme case, the composition may be purely dynamical. Asyncronicity is preserved in the composition. The semantics of the composed model allow to not care about the presence of “cyclic constraints”. The composition does not exclude the presence of pathological events (Zeno or blocking, for instance), which arises at an internal level. A rather slack condition on the continuity of the interconnecting maps allows to preserve determinism in the composition. Furthermore, commutativity and associativity are two properties of the composition. Composing Hybrid Systems Specifications. In this section we consider rather general specifications defined on trajectories in the observation space. They may be defined, for instance, via temporal logic formulae for real-time systems. Furthermore, we shall also introduce an explicit dependence on the control signals: this would allow to express specifications that are general enough to cover the most important problems in control theory. Instances of such specifications are that of reachability, invariance, viability, attractivity. Safety, liveness and forward progress can be reinterpreted through the above properties, as well as verification and control synthesis tasks. We look for the set of trajectories, that is the behaviors, that verify a particular specification. Because of the deterministic hypothesis for the model, it is possible to associate this set of trajectories to a certain collection of initial conditions. Given two HCS, two corresponding specifications and a composition procedure, the composed specification is defined as the conjunction of the two original specifications, modulo proper variables substitutions according to the interconnection maps associated with the composition procedure. Consider the cartesian product of the sets of initial conditions of the single systems associated with trajectories that verify the corresponding property. Within this set, it is particularly interesting to look at the set of initial conditions in the composed system, that originate trajectories that do not verify the composed specification. These initial conditions are associated to “pathological” executions. It is indeed among the trajectories in this set that we shall categorize those associated with deadlock and livelock. Definition of Deadlock and Livelock for Hybrid Control Systems. From a dynamical standpoint, the concepts of deadlock and livelock are intrinsically related to the idea of a trajectory being “constrained” or “stalled” somewhere in the state space. This locking condition is then further specified with regards to the presence or absence of indefinite motion within the region. The fundamental concepts of this paper are then qualitatively introduced as follows. The “pathological” trajectories singled out above can be of two kinds: those that end up in a hybrid invariant set, and those that do not (this last is the set of diverging trajectories)!!!la frase tra parentesi la eliminerei!!!. Those that do enter in an invariant set are either deadlock or livelock : the first are characterized by the absence of motion in finite time (“stalling” situations). The second are instead characterized by endless motion, either in their continuous or discrete component. Notice that the definition above hinges on a purely dynamical level. This represents the last point, after that of composition and that of specification, which is regarded as necessary to introduce the notions of deadlock and livelock in the framework of HCS. Special instances of the above behaviors that are “notorious” for HCS are, in the case of deadlock situations, blocking conditions, stable equilibria in finite time, chattering and genuine Zeno. For the case of livelock, examples are represented by stable equilibria in infinite time and limit cycles. Conclusions and Future Work. This extended abstract only qualitatively introduces the concept of deadlock and livelock for HCS. A number of fundamental details have been skipped for the sake of space. Also, interesting interpretations of the above concepts in a number of application instances have not been reported in this work. An extended and detailed manuscript can be found in the form of a technical report on line [1]. From the above discussions, it comes at no surprise that the next obligatory step after that of defining and characterizing the notion of deadlock and livelock for HCS is that of looking at ways to detect it. Deadlock and Livelock prevention and resolution are other topics that do not find space in the present paper. The authors are also working on other extensions of the presented results. The concept of composition is prone to be generalized, and the issue of “deep composition”, i.e. of a composition procedure preserving certain properties, clearly connects with the above ideas when the absence of deadlock or livelock is the specification to be exported.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

Deadlock Control for Weighted Systems of Simple Sequential Processes with Resources Requirement (WS3PR)

Current deadlock control approaches for WSPR (Weighted Systems of Simple Sequential Processes with Resources Requirement) suffer from incorrect liveness characterization based on the concept of deadly marked siphons (DMS). We discover that nonlive transitions may exist even though there are no DMS. That is, the net model may be weakly live or in livelock states under no DMS. It is live under a ...

متن کامل

Abstraction-Based Livelock/Deadlock Checking for Hardware Verification

ion-Based Livelock/Deadlock Checking for Hardware Verification In-Ho Moon and Kevin Harer Synopsys Inc. {mooni, kevinh}@synopsys.com

متن کامل

A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems

We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method abstracts a system into a set of simple control flow cycles labeled with their message passing effects. From these cycles, it constructs a homogeneous integer programming problem (IP) encoding a necessary condition for the existence of livelock runs. Livelock free...

متن کامل

Local Livelock Analysis of Component-Based Models

In previous work we have proposed a correct-by-construction approach for building deadlock-free CSP models. It contains a comprehensive set of composition rules that capture safe steps in the development of concurrent systems. In this paper, we extend that work by proposing and implementing a strategy for establishing livelock freedom based on constructive rules similar to those that ensure the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007